#include<bits/stdc++.h>
using namespace std;
int n,r[100010],cnt[100010];
int ans=-1;
int main(){




    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);







    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>r[i];
    }
    sort(r+1,r+n+1);
    int sum=1;
    for(int i=1;i<=n;i++){
        if(r[i]==r[i+1]){
            cnt[sum]++;
        }
        else sum++;
    }
    for(int i=1;i<=sum-1;i++){
        ans=max(ans,cnt[i]+1);
    }
    cout<<ans<<endl;
    return 0;
}
